@greptile

Greptile Summary

This PR optimizes the FlatSearcher by replacing std::map with std::unordered_map for the internal key_id_mapping_ data structure. The change is well-justified and safe:

• Usage pattern supports the change: The mapping is only used for point lookups via find() and insertions via operator[] — no iteration, no ordering dependencies, no range queries
• Performance improvement: Reduces lookup complexity from O(log N) to O(1), and index load from O(N log N) to O(N)
• Type compatibility: Both key_t (uint64_t) and node_id_t (uint32_t) are primitive types with standard hash functions
• No behavioral changes: The change is purely internal; external API and semantics remain unchanged

Confidence Score: 5/5

• This PR is safe to merge with no risk
• The change is a straightforward container swap with no logic changes. All uses of key_id_mapping_ are compatible with unordered_map (point lookups, insertions, clearing). The types are primitive integers with standard hash functions. The change improves performance without any behavioral side effects.
• No files require special attention

Important Files Changed

_{Last reviewed commit: b41a87a}